package leetcode;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.TreeSet;

/**
 * Created by MtRider on 2021/10/19 22:12
 */
public class MaxSubArray {
    public static void main(String[] args) {

    }
    public static void merge(int[] nums1, int m, int[] nums2, int n) {
        nums1=new int[m+n];
        for (int i = 0; i < n; i++) {
            nums1[m+i]=nums2[i];
        }
        Arrays.sort(nums1);
        /*int nums [] =new int[m+n];
        for (int i = 0; i < m; i++) {
            nums[i]=nums1[i];
        }
        for (int i = 0; i < n; i++) {
            nums[m+i]=nums2[i];
        }
        Arrays.sort(nums);
        for (int num : nums) {
            System.out.println(num);
        }*/
    }
}
